An Improved Buffer Scheme in Delay Tolerant Networks

نویسندگان

  • Jian Shen
  • Wenying Zheng
  • Jin Wang
  • Yuhui Zheng
  • Yuan Mei
چکیده

Delay Tolerant Networks (DTNs) are a class of emerging networks where disconnections may occur frequently due to propagation phenomena, node mobility, and power outages. Delay is inevitable in DTNs, thus, making better use of buffer space to maximize the packet delivery rate is more important than concentrating on how to decrease the delay. In this paper, we improve the buffer scheme of Epidemic Routing, which is a well-known routing protocol in DTNs. Epidemic Routing utilizes the FIFO buffer management scheme to manage the queuing. However, Epidemic Routing is still very sensitive to the buffer size. Epidemic Routing, furthermore, can only achieve good performance with respect to infinite buffer size due to that a node may have enough space to store lots of messages in its buffer and carry them along for long periods of times until appropriate forwarding opportunities arise. Once there is not enough buffer size, then the performance of Epidemic Routing will fall down hastily. We propose a new buffer scheme in Epidemic Routing, named Location and Direction Aware Drop Scheme (LDDS). LDDS utilizes the location and moving direction information of nodes to determine the drop sequence. A node can get the location and moving direction information of other nodes by receiving beacon packets periodically from anchor nodes and referring to received signal strength indicator (RSSI) for the beacon. In particular, LDDS is able to guarantee the high packet delivery ratio under small buffer size.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Energy-Aware Probabilistic Epidemic Forwarding Method in Heterogeneous Delay Tolerant Networks

Due to the increasing use of wireless communications, infrastructure-less networks such as Delay Tolerant Networks (DTNs) should be highly considered. DTN is most suitable where there is an intermittent connection between communicating nodes such as wireless mobile ad hoc network nodes. In general, a message sending node in DTN copies the message and transmits it to nodes which it encounters. A...

متن کامل

A Multi-scheme Adaptive Routing Algorthm Based on Spray and Wait for Dalay Tolerant Networks

Delay tolerant networks (DTNs) are a type of emerging mobile wireless network that experience long delays, intermittent disruption, buffer space and energy limitations, node irregularities and frequent mobility. To this end, many protocols take advantage of the flooding mechanism to increase the probability of successful message transmission. However, sending too many copies of each message may...

متن کامل

Deadline Aware Hybrid Data Forwarding Scheme in Delay Tolerant Networks

Even though long delay is permitted in Delay Tolerant Networks (DTNs), some applications explicitly demand an upper bound imposed on message delivery delay for the application specific purpose. Despite some researcher have proposed to meet new requirement, their approaches have weakness in the point of implementation since infinite buffer space on a node or the knowledge prior the moment regard...

متن کامل

M1, M2, ..., Mk/G1, G2,..., Gk/l/N Queue with Buffer Division and Push-Out Schemes for ATM Networks (RESEARCH NOTE)

In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...

متن کامل

Analysis of Block Delivery Delay in Network Coding-Based Delay Tolerant Networks

An important factor determining the performance of delay tolerant networks (DTNs) is packet delivery delay. In this paper, we study the block delivery delay of DTN with the epidemic routing scheme based on random linear network coding (RLNC). First, simulations show that the influence of relay buffer size on the delivery delay is not as strong in RLNC-based routing as it is in replica-based rou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013